PRACTICAL STEADY-STATE SCHEDULING FOR TREE-SHAPED TASK GRAPHS
نویسندگان
چکیده
منابع مشابه
Practical steady-State Scheduling for Tree-Shaped Task Graphs
In this paper, we focus on the problem of scheduling a collection of similar task graphs on a heterogeneous platform, when the task graph is an intree. We rely on steady-state scheduling techniques, and aim at optimizing the throughput of the system. Contrarily to previous studies, we concentrate on practical aspects of steady-state scheduling, when dealing with a collection (or batch) of limit...
متن کاملSteady-State for Batches of Identical Task Graphs
In this paper, we focus on the problem of scheduling batches of identical task graphs on a heterogeneous platform, when the task graph consists in a tree. We rely on steady-state scheduling, and aim at reaching the optimal throughput of the system. Contrarily to previous studies, we concentrate upon the scheduling of batches of limited size. We try to reduce the processing time of each instance...
متن کاملA Heuristic Greedy Algorithm for Scheduling Out-Tree Task Graphs
The scheduling of Out-Tree task graphs is one of the critical factors in implementing the compilers of parallel languages and improving the performance of parallel computing. Although there are a few heterogeneity based algorithms in the literature suitable for scheduling Out-Tree task graphs, they usually require significantly high scheduling costs and may not deliver good quality schedules wi...
متن کاملSteady-State Scheduling
In this chapter, we propose a general framework for deriving efficient (polynomial-time) algorithms for steady-state scheduling. In the context of large scale platforms (grids or volunteer computing platforms), we show that the characteristics of the resources (volatility, heterogeneity) limit their use to large regular applications. Therefore, steady-state scheduling, that consists in optimizi...
متن کاملScheduling loosely connected task graphs
We present a polynomial time algorithm for precedence constrained scheduling problems in which the task graph can be partitioned into large disjoint parts by removing edges with high oat, where the oat of an edge is deened as the diierence between the length of the longest path in the graph and the length of the longest path containing the edge. Our algorithm guarantees schedules within a facto...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Parallel Processing Letters
سال: 2011
ISSN: 0129-6264,1793-642X
DOI: 10.1142/s0129626411000291